The Relation Between Diamond Tiling and Hexagonal Tiling
نویسندگان
چکیده
منابع مشابه
The Relation Between Diamond Tiling and Hexagonal Tiling
Iterative stencil computations are important in scientific computing and more and more also in the embedded and mobile domain. Recent publications have shown that tiling schemes that ensure concurrent start provide efficient ways to execute these kernels. Diamond tiling and hybrid-hexagonal tiling are two successful tiling schemes that enable concurrent start. Both have different advantages: di...
متن کاملThe Promises of Hybrid Hexagonal/Classical Tiling for GPU
Time-tiling is necessary for e cient execution of iterative stencil computations. But the usual hyper-rectangular tiles cannot be used because of positive/negative dependence distances along the stencil's spatial dimensions. Several prior e orts have addressed this issue. However, known techniques trade enhanced data reuse for other causes of ine ciency, such as unbalanced parallelism, redundan...
متن کاملTiling Bijections between Paths and Brauer Diagrams
There is a natural bijection between Dyck paths and basis diagrams of the Temperley-Lieb algebra defined via tiling. Overhang paths are certain generalisations of Dyck paths allowing more general steps but restricted to a rectangle in the twodimensional integer lattice. We show that there is a natural bijection, extending the above tiling construction, between overhang paths and basis diagrams ...
متن کاملOptimal Tiling
Iteration space tiling is a common strategy used by parallelizing compilers to reduce communication overhead. We address the problem of determining the optimal tile size (which minimizes the total execution time of the program), for a particular program schema. We use a realistic model of the architecture which accounts for coprocessors that permit overlapping of communication and computation, ...
متن کاملTiling Databases
In this paper, we consider 0/1 databases and provide an alternative way of extracting knowledge from such databases using tiles. A tile is a region in the database consisting solely of ones. The interestingness of a tile is measured by the number of ones it consists of, i.e., its area. We present an efficient method for extracting all tiles with area at least a given threshold. A collection of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Parallel Processing Letters
سال: 2014
ISSN: 0129-6264,1793-642X
DOI: 10.1142/s0129626414410023